First-Order Theory of Subtyping Constraints

نویسندگان

  • Zhendong Su
  • Alexander Aiken
  • Tim Priesnitz
  • Ralf Treinen
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The First-Order Theory of Subtype Constraints

We investigate the first-order theory of subtype constraints. We show that the first-order theory of non-structural subtyping is undecidable, and we show that in the case where all constructors are either unary or nullary, the first-order theory is decidable for both structural and non-structural subtyping. Our results hold for both simple and recursive types. The undecidability result is shown...

متن کامل

On the Theory of Structural Subtyping

We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let Σ be a language consisting of function symbols (representing type constructors) and C a decidable structure in the relational language L containing a binary relation ≤. C represents primitive types; ≤ represents a subtype ordering. We introduce the notion of Σ-term-power of C, which generalizes ...

متن کامل

Internship report: Uniform and non-structural subtyping

We expose a new approach to tackle non-structural subtyping problems. We introduce uniform subtyping as a means to capture some properties of non-structural subtyping. In the uniform theory, we show that the validity of a first-order sentence is decidable, and entailment is PSPACEhard. In addition, we give decidable approximations to entailment and subtyping constrained types — two problems whi...

متن کامل

Phantom Types and Subtyping

We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to model a subtyping hierarchy. Hindley-Milner type systems, such as the one found in Standard ML, can be used to enforce the subtyping relation, at least for first-order values. We show that this technique can be used to e...

متن کامل

Formalization of Coercions in Lexical Semantics

Originally developed for use in programming languages with simple type systems (see, for example, [22]), coercions between types, including many subtypes of the type of entities (eventualities, physical objects, informational objects, etc.), have been widely employed in linguistic semantics [26, 30, 28, 3]. There are, however, two problems with coercions. First, it has been unclear how coercion...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007